home *** CD-ROM | disk | FTP | other *** search
/ Total Network Tools 2002 / NextStepPublishing-TotalNetworkTools2002-Win95.iso / Archive / Misc Servers / Zope.exe / TREETAG.PY < prev    next >
Encoding:
Python Source  |  2000-08-23  |  23.2 KB  |  688 lines
  1. ##############################################################################
  2. # 
  3. # Zope Public License (ZPL) Version 1.0
  4. # -------------------------------------
  5. # 
  6. # Copyright (c) Digital Creations.  All rights reserved.
  7. # 
  8. # This license has been certified as Open Source(tm).
  9. # 
  10. # Redistribution and use in source and binary forms, with or without
  11. # modification, are permitted provided that the following conditions are
  12. # met:
  13. # 
  14. # 1. Redistributions in source code must retain the above copyright
  15. #    notice, this list of conditions, and the following disclaimer.
  16. # 
  17. # 2. Redistributions in binary form must reproduce the above copyright
  18. #    notice, this list of conditions, and the following disclaimer in
  19. #    the documentation and/or other materials provided with the
  20. #    distribution.
  21. # 
  22. # 3. Digital Creations requests that attribution be given to Zope
  23. #    in any manner possible. Zope includes a "Powered by Zope"
  24. #    button that is installed by default. While it is not a license
  25. #    violation to remove this button, it is requested that the
  26. #    attribution remain. A significant investment has been put
  27. #    into Zope, and this effort will continue if the Zope community
  28. #    continues to grow. This is one way to assure that growth.
  29. # 
  30. # 4. All advertising materials and documentation mentioning
  31. #    features derived from or use of this software must display
  32. #    the following acknowledgement:
  33. # 
  34. #      "This product includes software developed by Digital Creations
  35. #      for use in the Z Object Publishing Environment
  36. #      (http://www.zope.org/)."
  37. # 
  38. #    In the event that the product being advertised includes an
  39. #    intact Zope distribution (with copyright and license included)
  40. #    then this clause is waived.
  41. # 
  42. # 5. Names associated with Zope or Digital Creations must not be used to
  43. #    endorse or promote products derived from this software without
  44. #    prior written permission from Digital Creations.
  45. # 
  46. # 6. Modified redistributions of any form whatsoever must retain
  47. #    the following acknowledgment:
  48. # 
  49. #      "This product includes software developed by Digital Creations
  50. #      for use in the Z Object Publishing Environment
  51. #      (http://www.zope.org/)."
  52. # 
  53. #    Intact (re-)distributions of any official Zope release do not
  54. #    require an external acknowledgement.
  55. # 
  56. # 7. Modifications are encouraged but must be packaged separately as
  57. #    patches to official Zope releases.  Distributions that do not
  58. #    clearly separate the patches from the original work must be clearly
  59. #    labeled as unofficial distributions.  Modifications which do not
  60. #    carry the name Zope may be packaged in any form, as long as they
  61. #    conform to all of the clauses above.
  62. # 
  63. # 
  64. # Disclaimer
  65. # 
  66. #   THIS SOFTWARE IS PROVIDED BY DIGITAL CREATIONS ``AS IS'' AND ANY
  67. #   EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  68. #   IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  69. #   PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL DIGITAL CREATIONS OR ITS
  70. #   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  71. #   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  72. #   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
  73. #   USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  74. #   ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  75. #   OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
  76. #   OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  77. #   SUCH DAMAGE.
  78. # 
  79. # 
  80. # This software consists of contributions made by Digital Creations and
  81. # many individuals on behalf of Digital Creations.  Specific
  82. # attributions are listed in the accompanying credits file.
  83. # 
  84. ##############################################################################
  85. """Rendering object hierarchies as Trees
  86. """
  87. __rcs_id__='$Id: TreeTag.py,v 1.42.8.1 2000/08/23 20:50:37 brian Exp $'
  88. __version__='$Revision: 1.42.8.1 $'[11:-2]
  89.  
  90. from DocumentTemplate.DT_Util import *
  91. from DocumentTemplate.DT_String import String
  92.  
  93. from string import join, split, rfind, find, translate
  94. from urllib import quote, unquote
  95. from zlib import compress, decompress
  96. from binascii import b2a_base64, a2b_base64
  97.  
  98. tbl=join(map(chr, range(256)),'')
  99. tplus=tbl[:ord('+')]+'-'+tbl[ord('+')+1:]
  100. tminus=tbl[:ord('-')]+'+'+tbl[ord('-')+1:]
  101.  
  102. class Tree:
  103.     name='tree'
  104.     blockContinuations=()
  105.     expand=None
  106.  
  107.     def __init__(self, blocks):
  108.         tname, args, section = blocks[0]
  109.         args=parse_params(args, name=None, expr=None, nowrap=1, 
  110.                           expand=None, leaves=None,
  111.                           header=None, footer=None,
  112.                           branches=None, branches_expr=None,
  113.                           sort=None, reverse=1, skip_unauthorized=1,
  114.                           id=None, single=1, url=None,
  115.                           # opened_decoration=None,
  116.                           # closed_decoration=None,
  117.                           # childless_decoration=None,
  118.                           assume_children=1,
  119.                           urlparam=None)
  120.         has_key=args.has_key
  121.  
  122.         if has_key('') or has_key('name') or has_key('expr'):
  123.             name,expr=name_param(args,'tree',1)
  124.  
  125.             if expr is not None: args['expr']=expr
  126.             elif has_key(''): args['name']=name
  127.         else: name='a tree tag'
  128.  
  129.         if has_key('branches_expr'):
  130.             if has_key('branches'):
  131.                 raise ParseError, _tm(
  132.                     'branches and  and branches_expr given', 'tree')
  133.             args['branches_expr']=VSEval.Eval(
  134.                 args['branches_expr'], expr_globals).eval
  135.         elif not has_key('branches'): args['branches']='tpValues'
  136.  
  137.         if not has_key('id'): args['id']='tpId'
  138.         if not has_key('url'): args['url']='tpURL'
  139.         if not has_key('childless_decoration'):
  140.             args['childless_decoration']=''
  141.         
  142.         self.__name__ = name
  143.         self.section=section.blocks
  144.         self.args=args
  145.             
  146.  
  147.     def render(self,md):
  148.         args=self.args
  149.         have=args.has_key
  150.  
  151.         if have('name'): v=md[args['name']]
  152.         elif have('expr'): v=args['expr'].eval(md)
  153.         else: v=md.this
  154.         return tpRender(v,md,self.section, self.args)
  155.  
  156.     __call__=render
  157.  
  158. String.commands['tree']=Tree
  159.  
  160. pyid=id # Copy builtin
  161.  
  162. def tpRender(self, md, section, args,
  163.              simple_type={type(''):0, type(1):0, type(1.0):0}.has_key):
  164.     """Render data organized as a tree.
  165.  
  166.     We keep track of open nodes using a cookie.  The cookie stored the
  167.     tree state. State should be a tree represented like:
  168.  
  169.       []  # all closed
  170.       ['eagle'], # eagle is open
  171.       ['eagle'], ['jeep', [1983, 1985]]  # eagle, jeep, 1983 jeep and 1985 jeep
  172.  
  173.     where the items are object ids. The state will be converted to a
  174.     compressed and base64ed string that gets unencoded, uncompressed, 
  175.     and evaluated on the other side.
  176.  
  177.     Note that ids used in state need not be connected to urls, since
  178.     state manipulation is internal to rendering logic.
  179.  
  180.     Note that to make eval safe, we do not allow the character '*' in
  181.     the state.
  182.     """
  183.  
  184.     data=[]
  185.  
  186.     idattr=args['id']
  187.     if hasattr(self, idattr):
  188.         id=getattr(self, idattr)
  189.         if not simple_type(type(id)): id=id()            
  190.     elif hasattr(self, '_p_oid'): id=oid(self)
  191.     else: id=pyid(self)
  192.  
  193.     try:
  194.         # see if we are being run as a sub-document
  195.         root=md['tree-root-url']
  196.         url=md['tree-item-url']
  197.         state=md['tree-state']
  198.         diff=md['tree-diff']
  199.         substate=md['-tree-substate-']
  200.         colspan=md['tree-colspan']      
  201.         level=md['tree-level']
  202.  
  203.     except KeyError:
  204.         # OK, we are a top-level invocation
  205.         level=-1
  206.  
  207.         if md.has_key('collapse_all'):
  208.             state=[id,[]],
  209.         elif md.has_key('expand_all'):
  210.             have_arg=args.has_key
  211.             if have_arg('branches'):
  212.                 def get_items(node, branches=args['branches'], md=md):
  213.                     validate=md.validate
  214.                     if validate is None or not hasattr(node, 'aq_acquire'):
  215.                         items=getattr(node, branches)
  216.                     else:
  217.                         items=node.aq_acquire(branches, validate, md)
  218.                     return items()
  219.             elif have_arg('branches_expr'):
  220.                 def get_items(node, branches_expr=args['branches_expr'], md=md):
  221.                     md._push(InstanceDict(node, md))
  222.                     items=branches_expr(md)
  223.                     md._pop()
  224.                     return items
  225.             state=[id, tpValuesIds(self, get_items, args)],
  226.         else:
  227.             if md.has_key('tree-s'):
  228.                 state=md['tree-s']
  229.                 state=decode_seq(state)
  230.                 try:
  231.                     if state[0][0] != id: state=[id,[]],
  232.                 except IndexError: state=[id,[]],
  233.             else: state=[id,[]],
  234.  
  235.             if md.has_key('tree-e'):
  236.                 diff=decode_seq(md['tree-e'])
  237.                 apply_diff(state, diff, 1)
  238.  
  239.             if md.has_key('tree-c'):
  240.                 diff=decode_seq(md['tree-c'])
  241.                 apply_diff(state, diff, 0)
  242.  
  243.         colspan=tpStateLevel(state)
  244.         substate=state
  245.         diff=[]
  246.  
  247.         url=''
  248.         root=md['URL']
  249.         l=rfind(root,'/')
  250.         if l >= 0: root=root[l+1:]
  251.  
  252.     treeData={'tree-root-url': root,
  253.               'tree-colspan': colspan,
  254.               'tree-state': state }
  255.     
  256.     md._push(InstanceDict(self, md))
  257.     md._push(treeData)
  258.  
  259.     try: tpRenderTABLE(self,id,root,url,state,substate,diff,data,colspan,
  260.                        section,md,treeData, level, args)
  261.     finally: md._pop(2)
  262.  
  263.     if state is substate and not (args.has_key('single') and args['single']):
  264.         state=state or ([id],)
  265.         state=encode_seq(state)
  266.         md['RESPONSE'].setCookie('tree-s',state)
  267.  
  268.     return join(data,'')
  269.  
  270. def tpRenderTABLE(self, id, root_url, url, state, substate, diff, data,
  271.                   colspan, section, md, treeData, level=0, args=None,
  272.                   simple_type={type(''):0, type(1):0, type(1.0):0}.has_key,
  273.                   ):
  274.     "Render a tree as a table"
  275.  
  276.     have_arg=args.has_key
  277.     exp=0
  278.  
  279.     if level >= 0:
  280.         urlattr=args['url']
  281.         if urlattr and hasattr(self, urlattr):
  282.             tpUrl=getattr(self, urlattr)
  283.             if not simple_type(type(tpUrl)): tpUrl=tpUrl()            
  284.             url = (url and ('%s/%s' % (url, tpUrl))) or tpUrl
  285.             root_url = root_url or tpUrl
  286.  
  287.     treeData['tree-item-url']=url
  288.     treeData['tree-level']=level
  289.     treeData['tree-item-expanded']=0
  290.     idattr=args['id']
  291.  
  292.     output=data.append
  293.  
  294.     items=None
  295.     if (have_arg('assume_children') and args['assume_children']
  296.         and substate is not state):
  297.         # We should not compute children unless we have to.
  298.         # See if we've been asked to expand our children.
  299.         for i in range(len(substate)):
  300.             sub=substate[i]
  301.             if sub[0]==id:
  302.                 exp=i+1
  303.                 break
  304.         if not exp: items=1
  305.  
  306.     if items is None:
  307.         validate=md.validate
  308.         if have_arg('branches') and hasattr(self, args['branches']):
  309.             if validate is None or not hasattr(self, 'aq_acquire'):
  310.                 items=getattr(self, args['branches'])
  311.             else:
  312.                 items=self.aq_acquire(args['branches'],validate,md)
  313.             items=items()
  314.         elif have_arg('branches_expr'):
  315.             items=args['branches_expr'](md)
  316.  
  317.         if not items and have_arg('leaves'): items=1
  318.  
  319.     if items and items != 1:
  320.  
  321.         if validate is not None:
  322.             unauth=[]
  323.             index=0
  324.             for i in items:
  325.                 try: v=validate(items,items,None,i,md)
  326.                 except: v=0
  327.                 if not v: unauth.append(index)
  328.                 index=index+1
  329.  
  330.             if unauth:
  331.                 if have_arg('skip_unauthorized') and args['skip_unauthorized']:
  332.                     items=list(items)
  333.                     unauth.reverse()
  334.                     for i in unauth: del items[i]
  335.                 else:
  336.                     raise ValidationError, unauth
  337.  
  338.         if have_arg('sort'):
  339.             # Faster/less mem in-place sort
  340.             if type(items)==type(()):
  341.                 items=list(items)
  342.             sort=args['sort']
  343.             size=range(len(items))
  344.             for i in size:
  345.                 v=items[i]
  346.                 k=getattr(v,sort)
  347.                 try:    k=k()
  348.                 except: pass
  349.                 items[i]=(k,v)
  350.             items.sort()
  351.             for i in size:
  352.                 items[i]=items[i][1]
  353.  
  354.         if have_arg('reverse'):
  355.             items=list(items)           # Copy the list
  356.             items.reverse()
  357.  
  358.     diff.append(id)
  359.  
  360.  
  361.     _td_colspan='<TD COLSPAN="%s" NOWRAP></TD>'
  362.     _td_single ='<TD WIDTH="16" NOWRAP></TD>'
  363.  
  364.     sub=None
  365.     if substate is state:
  366.         output('<TABLE CELLSPACING="0">\n')
  367.         sub=substate[0]
  368.         exp=items
  369.     else:
  370.         # Add prefix
  371.         output('<TR>\n')
  372.  
  373.         # Add +/- icon
  374.         if items:
  375.             if level:
  376.                 if level > 3:   output(_td_colspan % (level-1))
  377.                 elif level > 1: output(_td_single * (level-1))
  378.                 output(_td_single)
  379.                 output('\n')
  380.             output('<TD WIDTH="16" VALIGN="TOP" NOWRAP>')
  381.             for i in range(len(substate)):
  382.                 sub=substate[i]
  383.                 if sub[0]==id:
  384.                     exp=i+1
  385.                     break
  386.  
  387.             ####################################
  388.             # Mostly inline encode_seq for speed
  389.             s=compress(str(diff))
  390.             if len(s) > 57: s=encode_str(s)
  391.             else:
  392.                 s=b2a_base64(s)[:-1]
  393.                 l=find(s,'=')
  394.                 if l >= 0: s=s[:l]
  395.             s=translate(s, tplus)
  396.             ####################################
  397.  
  398.             script=md['SCRIPT_NAME']
  399.  
  400.             # Propagate extra args through tree.
  401.             if args.has_key( 'urlparam' ):
  402.                 param = args['urlparam']
  403.                 param = "%s&" % param
  404.             else:
  405.                 param = ""
  406.  
  407.             if exp:
  408.                 treeData['tree-item-expanded']=1
  409.                 output('<A NAME="%s" HREF="%s?%stree-c=%s#%s">'
  410.                        '<IMG SRC="%s/p_/mi" ALT="-" BORDER=0></A>' %
  411.                        (id, root_url, param, s, id, script))
  412.             else:
  413.                 output('<A NAME="%s" HREF="%s?%stree-e=%s#%s">'
  414.                        '<IMG SRC="%s/p_/pl" ALT="+" BORDER=0></A>' %
  415.                        (id, root_url, param, s, id, script))
  416.             output('</TD>\n')
  417.  
  418.         else:
  419.             if level > 2:   output(_td_colspan % level)
  420.             elif level > 0: output(_td_single  * level)
  421.             output(_td_single)
  422.             output('\n')
  423.             
  424.     
  425.         # add item text
  426.         dataspan=colspan-level
  427.         output('<TD%s%s VALIGN="TOP" ALIGN="LEFT">' %
  428.                ((dataspan > 1 and (' COLSPAN="%s"' % dataspan) or ''),
  429.                (have_arg('nowrap') and args['nowrap'] and ' NOWRAP' or ''))
  430.                )
  431.         output(render_blocks(section, md))
  432.         output('</TD>\n</TR>\n')
  433.  
  434.  
  435.     if exp:
  436.  
  437.         level=level+1
  438.         dataspan=colspan-level
  439.         if level > 2:   h=_td_colspan % level
  440.         elif level > 0: h=_td_single  * level
  441.         else: h=''
  442.  
  443.         if have_arg('header'):
  444.             doc=args['header']
  445.             if md.has_key(doc): doc=md.getitem(doc,0)
  446.             else: doc=None
  447.             if doc is not None:
  448.                 output(doc(
  449.                     None, md,
  450.                     standard_html_header=(
  451.                         '<TR>%s<TD WIDTH="16" NOWRAP></TD>'
  452.                         '<TD%s VALIGN="TOP">'
  453.                         % (h,
  454.                            (dataspan > 1 and (' COLSPAN="%s"' % dataspan)
  455.                             or ''))),
  456.                     standard_html_footer='</TD></TR>',
  457.                     ))
  458.             
  459.         if items==1:
  460.             # leaves
  461.             if have_arg('leaves'):
  462.                 doc=args['leaves']
  463.                 if md.has_key(doc): doc=md.getitem(doc,0)
  464.                 else: doc=None
  465.                 if doc is not None:
  466.                     treeData['-tree-substate-']=sub
  467.                     treeData['tree-level']=level
  468.                     md._push(treeData)
  469.                     try: output(doc(
  470.                         None,md,
  471.                         standard_html_header=(
  472.                             '<TR>%s<TD WIDTH="16" NOWRAP></TD>'
  473.                             '<TD%s VALIGN="TOP">'
  474.                             % (h,
  475.                                (dataspan > 1 and
  476.                                 (' COLSPAN="%s"' % dataspan) or ''))),
  477.                         standard_html_footer='</TD></TR>',
  478.                         ))
  479.                     finally: md._pop(1)
  480.         elif have_arg('expand'):
  481.             doc=args['expand']
  482.             if md.has_key(doc): doc=md.getitem(doc,0)
  483.             else: doc=None
  484.             if doc is not None:
  485.                 treeData['-tree-substate-']=sub
  486.                 treeData['tree-level']=level
  487.                 md._push(treeData)
  488.                 try: output(doc(
  489.                     None,md,
  490.                     standard_html_header=(
  491.                         '<TR>%s<TD WIDTH="16" NOWRAP></TD>'
  492.                         '<TD%s VALIGN="TOP">'
  493.                         % (h,
  494.                            (dataspan > 1 and
  495.                             (' COLSPAN="%s"' % dataspan) or ''))),
  496.                     standard_html_footer='</TD></TR>',
  497.                     ))
  498.                 finally: md._pop(1)
  499.         else:
  500.             __traceback_info__=sub, args, state, substate
  501.             ids={}
  502.             for item in items:
  503.                 if hasattr(item, idattr):
  504.                     id=getattr(item, idattr)
  505.                     if not simple_type(type(id)): id=id()
  506.                 elif hasattr(item, '_p_oid'): id=oid(item)
  507.                 else: id=pyid(item)
  508.                 if len(sub)==1: sub.append([])
  509.                 substate=sub[1]
  510.                 ids[id]=1
  511.                 md._push(InstanceDict(item,md))
  512.                 try: data=tpRenderTABLE(
  513.                     item,id,root_url,url,state,substate,diff,data,
  514.                     colspan, section, md, treeData, level, args)
  515.                 finally: md._pop()
  516.                 if not sub[1]: del sub[1]
  517.  
  518.             ids=ids.has_key
  519.             for i in range(len(substate)-1,-1):
  520.                 if not ids(substate[i][0]): del substate[i]
  521.  
  522.         if have_arg('footer'):
  523.             doc=args['footer']
  524.             if md.has_key(doc): doc=md.getitem(doc,0)
  525.             else: doc=None
  526.             if doc is not None:
  527.                 output(doc(
  528.                     None, md,
  529.                     standard_html_header=(
  530.                         '<TR>%s<TD WIDTH="16" NOWRAP></TD>'
  531.                         '<TD%s VALIGN="TOP">'
  532.                         % (h,
  533.                            (dataspan > 1 and (' COLSPAN="%s"' % dataspan)
  534.                             or ''))),
  535.                     standard_html_footer='</TD></TR>',
  536.                     ))
  537.  
  538.     del diff[-1]
  539.     if not diff: output('</TABLE>\n')
  540.  
  541.     return data
  542.  
  543.  
  544. def apply_diff(state, diff, expand):
  545.     if not diff: return
  546.     s=[None, state]
  547.     diff.reverse()
  548.     __traceback_info__=s, diff
  549.     while diff:
  550.         id=diff[-1]
  551.         del diff[-1]
  552.         if len(s)==1: s.append([])
  553.         s=s[1]
  554.         loc=-1
  555.         for i in range(len(s)):
  556.             if s[i][0]==id:
  557.                 loc=i
  558.                 break
  559.  
  560.         if loc >= 0:
  561.             if not diff and not expand:
  562.                 del s[loc]
  563.             else:
  564.                 s=s[loc]
  565.         elif diff or expand:
  566.             s.append([id,[]])
  567.             s=s[-1][1]
  568.             while diff:
  569.                 id=diff[-1]
  570.                 del diff[-1]
  571.                 if diff or expand:
  572.                     s.append([id,[]])
  573.                     s=s[-1][1]
  574.  
  575.  
  576. def encode_seq(state):
  577.     "Convert a sequence to an encoded string"
  578.     state=compress(str(state))
  579.     l=len(state)
  580.  
  581.     if l > 57:
  582.         states=[]
  583.         for i in range(0,l,57):
  584.             states.append(b2a_base64(state[i:i+57])[:-1])
  585.         state=join(states,'')
  586.     else: state=b2a_base64(state)[:-1]
  587.  
  588.     l=find(state,'=')
  589.     if l >= 0: state=state[:l]
  590.     
  591.     state=translate(state, tplus)
  592.     return state
  593.  
  594. def encode_str(state):
  595.     "Convert a sequence to an encoded string"
  596.     l=len(state)
  597.  
  598.     if l > 57:
  599.         states=[]
  600.         for i in range(0,l,57):
  601.             states.append(b2a_base64(state[i:i+57])[:-1])
  602.         state=join(states,'')
  603.     else: state=b2a_base64(state)[:-1]
  604.  
  605.     l=find(state,'=')
  606.     if l >= 0: state=state[:l]
  607.         
  608.     state=translate(state, tplus)
  609.     return state
  610.  
  611. def decode_seq(state):
  612.     "Convert an encoded string to a sequence"
  613.     state=translate(state, tminus)
  614.     l=len(state)
  615.  
  616.     if l > 76:
  617.         states=[]
  618.         j=0
  619.         for i in range(l/76):
  620.             k=j+76
  621.             states.append(a2b_base64(state[j:k]))
  622.             j=k
  623.  
  624.         if j < l:
  625.             state=state[j:]
  626.             l=len(state)
  627.             k=l%4
  628.             if k: state=state+'='*(4-k)
  629.             states.append(a2b_base64(state))
  630.         state=join(states,'')
  631.     else:
  632.         l=len(state)
  633.         k=l%4
  634.         if k: state=state+'='*(4-k)
  635.         state=a2b_base64(state)
  636.  
  637.     state=decompress(state)
  638.     if find(state,'*') >= 0: raise 'Illegal State', state
  639.     try: return list(eval(state,{'__builtins__':{}}))
  640.     except: return []
  641.     
  642.  
  643. def tpStateLevel(state, level=0):
  644.     for sub in state:
  645.         if len(sub)==2: level = max(level, 1+tpStateLevel(sub[1]))
  646.         else: level=max(level,1)
  647.     return level
  648.  
  649. def tpValuesIds(self, get_items, args,
  650.                 simple_type={type(''):0, type(1):0, type(1.0):0}.has_key,
  651.                 ):
  652.     # get_item(node) is a function that returns the subitems of node
  653.  
  654.     # This should build the ids of subitems which are
  655.     # expandable (non-empty). Leaves should never be
  656.     # in the state - it will screw the colspan counting.
  657.     r=[]
  658.     idattr=args['id']
  659.     try:
  660.         try: items=get_items(self)
  661.         except AttributeError: items=()
  662.         for item in items:
  663.             try:
  664.                 if get_items(item):
  665.  
  666.                     if hasattr(item, idattr):
  667.                         id=getattr(item, idattr)
  668.                         if not simple_type(type(id)): id=id()            
  669.                     elif hasattr(item, '_p_oid'): id=oid(item)
  670.                     else: id=pyid(item)
  671.  
  672.                     e=tpValuesIds(item, get_items, args)
  673.                     if e: id=[id,e]
  674.                     else: id=[id]
  675.                     r.append(id)
  676.             except: pass
  677.     except: pass
  678.     return r
  679.  
  680.  
  681. def oid(self):
  682.     return b2a_base64(str(self._p_oid))[:-1]
  683.     
  684.  
  685. #icoSpace='<IMG SRC="Blank_icon" BORDER="0">'
  686. #icoPlus ='<IMG SRC="Plus_icon" BORDER="0">'
  687. #icoMinus='<IMG SRC="Minus_icon" BORDER="0">'
  688.